A characterization of k-trees that are interval p-graphs
نویسندگان
چکیده
Interval p-graphs were introduced by Brown et al. in 2002 as a generalization of interval bigraphs [D.E. Brown, S.C. Flink and J.R. Lundgren, Congr. Numer. 157 (2002), 79–93]. Little work has been done towards characterizing them. For interval bigraphs the only known forbidden subgraph characterization is for trees. As it appears to be quite difficult to find a forbidden subgraph characterization, we limit our work to an extension of trees called k-trees. We characterize k-trees that are interval p-graphs as spiny interior k-lobsters and use this result to give a forbidden subgraph characterization.
منابع مشابه
Roman domination excellent graphs: trees
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
متن کاملInterval Routing on k-trees
A graph has an optimaì-interval routing scheme if it is possible to direct messages along shortest paths by labeling each edge with at most`pairwise-disjoint subintervals of the cyclic interval 1 : : : n] (where each node of the graph is labeled by an integer in the range). Although much progress has been made for`= 1, there is as yet no general tight characterization of the classes of graphs a...
متن کاملA characterization of 2-tree probe interval graphs
A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belongs to P . We characterize the 2-trees which are probe interval graphs and extend a list of forbidden induced subgraphs for such graphs created by ...
متن کاملConnections between labellings of trees
There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.
متن کاملAsymptotic behaviour of associated primes of monomial ideals with combinatorial applications
Let $R$ be a commutative Noetherian ring and $I$ be an ideal of $R$. We say that $I$ satisfies the persistence property if $mathrm{Ass}_R(R/I^k)subseteq mathrm{Ass}_R(R/I^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{Ass}_R(R/I)$ denotes the set of associated prime ideals of $I$. In this paper, we introduce a class of square-free monomial ideals in the polynomial ring $R=K[x_1,ld...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 49 شماره
صفحات -
تاریخ انتشار 2011